Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-
نویسندگان
چکیده
1. I n t r o d u c t i o n An important concern in building algebraic specifications is their hierarchical or modular structure. The same holds for term rewriting systems [1] which can be viewed as implementations of equational algebraic specifications. Specifically, it is of obvious interest to determine which *This paper is an abbreviated version of the IEICE technical report COMP88-30, July 1988. Now we are preparing a final version for submission based on this draft.
منابع مشابه
On modularity in infinitary term rewriting
We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that: • Confluence is not preserved across direct sum of a finite number of systems, even when these are non-collapsing. • Confluence modulo equality of hypercollapsing subterms is not preserved across direct sum of a finite number of systems. • Normalization is not preserved across direct sum o...
متن کاملModular Termination of r-Consistent and Left-Linear Term Rewriting Systems
A modular property of term rewriting systems is one that holds for the direct sum of two disjoint term rewriting systems iff it holds for every involved term rewriting system. A term rewriting system is r-consistent iff there is no term that can be rewritten to two different variables. We show that the subclass of left-linear and r-consistent term rewriting systems has the modular termination p...
متن کاملCounterexamples to Termination for the Direct Sum of Term Rewriting Systems
The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that the direct sum of two term rewriting systems is not terminating, even if these systems are both terminating. Keyword: Term rewriting system, termination Introduction A term rewriting system R is a set of rewriting rules M → N , where M and N are terms [1, 3, 5]. The di...
متن کاملModular Term Rewriting Systems and the Termination
The direct sum of two term rewriting systems (TRSs) [2,8] R, and R, is confluent if R, and R, are confluent [lo], but the direct sum is not necessarily terminating even if R, and R, are terminating [ll]; that is, termination is not a “modular” [6] property for general term rewriting systems. Recently, it was proved [9,5,12,4] that for some restricted classes of systems the direct sum is termina...
متن کاملTermination of term rewriting using dependency pairs
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left-and right-hand sides of rewrite rules, but introduce the notion of dependency pairs to compare left-hand sides with special subterms of the right-hand sides. This results in a technique which allows to apply existing methods for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989